A global Newton method to compute Nash equilibria
نویسندگان
چکیده
A new algorithm is presented for computing Nash equilibria of ̄nite games. Using Kohlberg and Mertens' structure theorem we show that a homotopy method can be represented as a dynamical system and implemented by Smale's global Newton method. The algorithm is outlined and computational experience is reported. JEL Classi ̄cation C63.
منابع مشابه
Global Newton Method for stochastic games
The Global Newton Method for games in normal form and in extensive form is shown to have a natural extension to computing Markov-perfect equilibria of stochastic games. GLOBAL NEWTON METHOD FOR STOCHASTIC GAMES SRIHARI GOVINDAN AND ROBERT WILSON Abstract. The Global Newton Method for games in normal form and in extensive form is shown to have a natural extension to computing Markov-perfect equi...
متن کاملA globalized Newton method for the computation of normalized Nash equilibria
The generalized Nash equilibrium is a Nash game, where not only the players’ cost functions, but also the constraints of a player depend on the rival players decisions. We present a globally convergent algorithm that is suited for the computation of a normalized Nash equilibrium in the generalized Nash game with jointly convex constraints. The main tool is the regularized Nikaido-Isoda function...
متن کاملComputing Nash Equilibria by Iterated Polymatrix Approximation
This article develops a new algorithm for computing a Nash equilibrium of an N-person game. The algorithm approximates the game by a sequence of polymatrix games. We provide su±cient conditions for local convergence to an equilibrium and report on our computational experience. The algorithm convergences rapidly but it is not failsafe. We show that if the algorithm does not converge then one can...
متن کاملComputing Nash Equilibria through Particle Swarm Optimization
This paper considers the application of a novel optimization method, namely Particle Swarm Optimization, to compute Nash equilibria. The problem of computing equilibria is formed as one of detecting the global minimizers of a real-valued, nonnegative, function. To detect more than one global minimizers of the function at a single run of the algorithm and address effectively the problem of local...
متن کاملNewton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation
We consider the generalized Nash equilibrium problem (GNEP), where not only the players’ cost functions but also their strategy spaces depend on the rivals’ decision variables. Existence results for GNEPs are typically shown by using a fixed point argument for a certain set-valued function. Here we use a regularization of this set-valued function in order to obtain a single-valued function that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Economic Theory
دوره 110 شماره
صفحات -
تاریخ انتشار 2003